A Uniied Analysis of Paging and Caching
نویسنده
چکیده
Paging (caching) is the problem of managing a two-level memory hierarchy in order to minimize the time required to process a sequence of memory accesses. In order to measure this quantity, we deene the system parameter miss penalty to represent the extra time required to access slow memory. In the context of paging , miss penalty is large, so most previous studies of on-line paging have implicitly set miss penalty = 1 in order to simplify the model. We show that this seemingly insigniicant simpliication substantially alters the precision of derived results. Consequently, we reintroduce miss penalty to the paging problem and present a more accurate analysis of on-line paging (and caching). We validate using this more accurate model by deriving intuitively appealing results for the paging problem which cannot be derived using the sim-pliied model.
منابع مشابه
Competitive caching of query results in search engines
We study the problem of caching query result pages in Web search engines. Popular search engines receive millions of queries per day, and for each query, return a result page to the user who submitted the query. The user may request additional result pages for the same query, submit a new query, or quit searching altogether. An efficient scheme for caching query result pages may enable search e...
متن کاملOnline Compression Caching
Motivated by the possibility of storing a file in a compressed format, we formulate the following class of compression caching problems. We are given a cache with a specified capacity, a certain number of compression/uncompression algorithms, and a set of files, each of which can be cached as it is or by applying one of the compression algorithms. Each compressed format of a file is specified b...
متن کاملExploiting Regularities in Web Traac Patterns for Cache Replacement
Caching web pages at proxies and in web servers' memories can greatly enhance performance. Proxy caching is known to reduce network load and both proxy and server caching can signiicantly decrease latency. Web caching problems have diierent properties than traditional operating systems paging , and cache replacement can beneet by recognizing and exploiting these diierences. We address two aspec...
متن کاملThe influence of lookahead in competitive on-line algorithms
In the competitive analysis of on-line problems, an on-line algorithm is presented with a sequence of requests to be served. The on-line algorithm must satisfy each request without the knowledge of any future requests. We consider the question of lookahead in on-line problems: What improvement can be achieved in terms of competitiveness, if the on-line algorithm sees not only the present reques...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998